Copertina

Practical Exploration of Polyhedral Model Checking

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Andriaccio, Yuri, Ciancia, Vincenzo, Latella, Diego, Massink, Mieke
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Logic in Computer Science 68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking
di: Bezhanishvili, Nick, et al.
Pubblicazione: (2024)

Software
Pubblicazione: (2023)

Systematic Mapping of the Literature on Smells in Software Development Requirements
di: Mayra-Alejandra Castillo-Motta
Pubblicazione: (2023)

A review of the impact on XP methodology of business model inclusion in requirements elicitation
di: Hugo Armando Ordoñez E.
Pubblicazione: (2015)

Task Completion Times and Complexity Metric Values from a Controlled Molecular Integration Study
di: Vierlboeck, Maximilian, et al.
Pubblicazione: (2026)

Agile Functional Requirements Modeling from Goal-Oriented Requirements Engineering: A Systematic Mapping Study
di: Francy-Idaly Muelas-Muelas
Pubblicazione: (2022)

Defining DSL design principles for enhancing the requirements elicitation process
di: J. Guadalupe Ramos-Díaz
Pubblicazione: (2012)

CosmoCore-Evo: Evolutionary Dream-Replay Reinforcement Learning for Adaptive Code Generation
di: Ravindran, Santhosh Kumar
Pubblicazione: (2025)

Computer Aided Verification
Pubblicazione: (2023)

Fundamental Approaches to Software Engineering
Pubblicazione: (2018)

A Model for Documenting Requirements Elicitation
di: Edgar Serna M.
Pubblicazione: (2023)

USING GROUNDED THEORY AS A METHOD FOR SYSTEM REQUIREMENTS ANALYSIS
di: Mohanad Halaweh
Pubblicazione: (2012)

On Bisimilarity for Quasi-discrete Closure Spaces
di: Ciancia, Vincenzo, et al.
Pubblicazione: (2023)

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
di: Bezhanishvili, Nick, et al.
Pubblicazione: (2024)

Programming Languages and Systems: 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings
di: Ahmed, Amal
Pubblicazione: (2018)

Proof Engine Verification (PROVED): Training and running today's frontier AI models consumes more electricity than entire small countries.
di: Proof Engine
Pubblicazione: (2026)

Claim Verification: "GLP-1 drugs like Ozempic cause unavoidable major muscle loss and "Ozempic face" even with exercise and high protein intake" — Disproved
di: Proof Engine
Pubblicazione: (2026)

Claim Verification: "The Pyramid of Giza was built by slaves." — Disproved
di: Proof Engine
Pubblicazione: (2026)

Claim Verification: "AI hallucinations occur on fewer than 5% of factual questions" — Disproved
di: Proof Engine
Pubblicazione: (2026)

Computer Aided Verification
Pubblicazione: (2023)

Automated Deduction – CADE 28
Pubblicazione: (2021)

The application of and unresolved problems regarding the use of objectives in software engineering
di: L.A. Lezcano
Pubblicazione: (2012)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
di: Proof Engine
Pubblicazione: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
di: Proof Engine
Pubblicazione: (2026)

Claim Verification: "Quantum entanglement enables the transmission of usable information faster than the speed of light when the distant parties pre-agree on a measurement basis." — Disproved
di: Proof Engine
Pubblicazione: (2026)

Computer Aided Verification
Pubblicazione: (2023)

Leibniz Transactions on Embedded Systems
Pubblicazione: (2015)

A visual analytics architecture for the analysis and understanding of software systems
di: Antonio González-Torres
Pubblicazione: (2019)

Frontiers of Combining Systems
Pubblicazione: (2023)

Computer Aided Verification
Pubblicazione: (2022)

Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II
Pubblicazione: (2018)

WEIGHTED SALIENCE ALLOCATION TO GOALS IN THE UNC-METHOD
di: CARLOS MARIO ZAPATA
Pubblicazione: (2013)

Principles of Security and Trust: 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings
Pubblicazione: (2018)

A Complete Fragment of LTL(EB)
di: Ferrarotti, Flavio, et al.
Pubblicazione: (2024)

Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part I
Pubblicazione: (2018)

Information quality and quantity-based model to represent the appropriateness of software requirements elicitation techniques
di: Luis Aguirre-Arredondo
Pubblicazione: (2017)

Confirmable Workflows in OSCAR
di: Joswig, Michael, et al.
Pubblicazione: (2024)

Computer Aided Verification
Pubblicazione: (2021)

Computer Aided Verification
Pubblicazione: (2021)

Tools and Algorithms for the Construction and Analysis of Systems
Pubblicazione: (2021)