28,586 Hits in 3.4 sec

Property Invariant Embedding for Automated Reasoning [article]

Miroslav Olšák, Cezary Kaliszyk, Josef Urban
2019 arXiv   pre-print
Automated reasoning and theorem proving have recently become major challenges for machine learning.  ...  Standard methods of embedding mathematical formulas for learning theorem proving are however yet unable to handle many important transformations.  ...  Urban was supported by the AI4REASON ERC Consolidator grant number 649043, and by the Czech project AI&Reasoning CZ.02.1.01/0.0/0.0/15 003/0000466 and the European Regional Development Fund.  ... 
arXiv:1911.12073v1 fatcat:znaq4ngpuzbbxlyuknpeiyosyi

AlloyInEcore: embedding of first-order relational logic into meta-object facility for automated model reasoning

Ferhat Erata, Arda Goknil, Ivan Kurtev, Bedir Tekinerdogan
2018 Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2018  
We present AlloyInEcore, a tool for specifying metamodels with their static semantics to facilitate automated, formal reasoning on models.  ...  It is crucial to reason about those models to ensure the correct and complete system specifications.  ...  automated model reasoning.  ... 
doi:10.1145/3236024.3264588 dblp:conf/sigsoft/ErataGKT18 fatcat:4gbr75wvb5gydpntwrbsmhfezy

Symbolic Computation and Automated Reasoning for Program Analysis [chapter]

Laura Kovács
2016 Lecture Notes in Computer Science  
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating  ...  Typical properties inferred by our work are loop invariants and expressions bounding the number of loop iterations.  ...  Verification methods combining symbolic computation and automated reasoning are therefore of critical importance for improving software reliability.  ... 
doi:10.1007/978-3-319-33693-0_2 fatcat:hyz76ibeuva2djyyejvvs2dbtu

No Crash, No Exploit: Automated Verification of Embedded Kernels [article]

Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival
2020 arXiv   pre-print
We propose a method that can verify both absence of runtime errors (i.e. crashes) and absence of privilege escalation (i.e. exploits) in embedded kernels from their binary executables.  ...  We demonstrate our method on two different use cases: we use our tool to help the development of a new embedded real-time kernel, and we verify an existing industrial real-time kernel executable with no  ...  ACKNOWLEDGEMENTS The authors warmly thank Gilles Muller, Amit Vasudevan, Pierre-Yves Piriou and Guerric Chupin, as well as the anonymous reviewers, for their very helpful remarks and discussions.  ... 
arXiv:2011.15065v1 fatcat:7qprfoncxjfs3eavcy4xzjwhwa

The Use of Rippling to Automate Event-B Invariant Preservation Proofs [chapter]

Yuhui Lin, Alan Bundy, Gudmund Grov
2012 Lecture Notes in Computer Science  
Proof automation is a common bottleneck for industrial adoption of formal methods.  ...  In Event-B, a significant proportion of proof obligations which require human interaction fall into a family called invariant preservation.  ...  Thanks to Omar Montano Rivas, Andrew Ireland, Moa Johansson and the AI4FM partners for the useful discussions.  ... 
doi:10.1007/978-3-642-28891-3_23 fatcat:onq7du7wmfc4pkm46jsdb2q2k4

Structural Embeddings: Mechanization with Method [chapter]

César Muñoz, John Rushby
1999 Lecture Notes in Computer Science  
We propose a technique called structural embedding that allows the structural elements of a method to be supported by a general-purpose tool, while substituting the logic of the tool for that of the method  ...  Conversely, those approaches that do provide a well-developed method generally have less powerful automation.  ...  Shankar and the anonymous referees for constructive criticism and helpful comments.  ... 
doi:10.1007/3-540-48119-2_26 fatcat:ro5cgwc7lnefdgfzbbel42ve5e

Automated Verification and Synthesis of Embedded Systems using Machine Learning [article]

Lucas Cordeiro
2017 arXiv   pre-print
In particular, machine learning techniques emerge as one of the main approaches to learn reliable implementations of embedded software for achieving a correct-by-construction design.  ...  The present research discusses challenges, problems, and recent advances to ensure correctness and timeliness regarding embedded systems.  ...  (RP1) provide suitable encoding into SMT, which may extend the background theories typically supported by SMT solvers, with the goal of reasoning accurately and effectively about realistic embedded (control  ... 
arXiv:1702.07847v2 fatcat:icus3c6bovbqvineb5n26ydcva

An algebra of alignment for relational verification [article]

Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo
2022 arXiv   pre-print
Effective alignment of the programs and computations to be related facilitates use of simpler relational invariants which in turn enables automation and modular reasoning.  ...  new RHL rules for such properties.  ...  This is especially important for automated reasoning, since restricted fragments such as linear arithmetic facilitate techniques like Horn clause solving to find invariants.  ... 
arXiv:2202.04278v2 fatcat:yaxw7d7kovfexg5i23rueqsbvy

Practical Aspects of Automated Deduction for Program Verification

Wolfgang Ahrendt, Bernhard Beckert, Martin Giese, Philipp Rümmer
2010 Künstliche Intelligenz  
This article describes the aspects of automated deduction that are important for program verification in practice, and it gives an overview of the reasoning mechanisms, the methodology, and the architecture  ...  Program verification is an increasingly important application area for automated deduction. The field has outgrown the area of academic case studies, and industry is showing serious interest.  ...  Program verification is concerned with proving that a program is consistent with some specification, which may be stated in terms of pre-/post-conditions, invariant properties, or termination properties  ... 
doi:10.1007/s13218-010-0001-y fatcat:oungj4soo5dkzpaz4botsf22hq

Flexible Intrusion Detection Systems for Memory-Constrained Embedded Systems

Farid Molazem Tabrizi, Karthik Pattabiraman
2015 2015 11th European Dependable Computing Conference (EDCC)  
Having the set of the security properties of the system and the invariants that verify those properties, we build an IDS that maximizes the coverage for the security properties, with respect to the available  ...  This makes building Intrusion Detection Systems (IDS) for embedded devices a necessity.  ...  Acknowledgment: This research was supported in part by the NSERC Strategic Networks Grants programme for Developing next generation Intelligent Vehicular Networks and Applications (DIVA) and a grant from  ... 
doi:10.1109/edcc.2015.17 dblp:conf/edcc/TabriziP15 fatcat:zxkpa7kgtjd45p26ko64odwqfq

Automatically Proving Microkernels Free from Privilege Escalation from their Executable [article]

Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival
2020 arXiv   pre-print
absence of privilege escalation with high confidence for a low cost.  ...  We applied our method on two embedded microkernels, including the industrial kernel AnonymOS: with only 58 lines of annotation and less than 10 minutes of computation, our method finds a vulnerability  ...  Experience has shown that in OS formal verification "invariant reasoning dominates the proof effort" 6 [8] , [20] , motivating our choice for fully-automated methods. E.  ... 
arXiv:2003.08915v1 fatcat:wggfoncabbcibn4m7fg5zpjr7i

Providing Automated Verification in HOL Using MDGs [chapter]

Tarek Mhamdi, Sofiène Tahar
2004 Lecture Notes in Computer Science  
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs.  ...  In this work, we present a verification framework in which we attempt to strike the balance between the expressiveness of theorem proving and the efficiency and automation of state exploration techniques  ...  In Figure 3 we present, for illustration purposes, how the operator AF on a firstorder property formula P [20] is embedded.  ... 
doi:10.1007/978-3-540-30476-0_24 fatcat:hdnnll3ldfd6vipdvgazdffd4a

Bellerophon: Tactical Theorem Proving for Hybrid Systems [chapter]

Nathan Fulton, Stefan Mitsch, Brandon Bohrer, André Platzer
2017 Lecture Notes in Computer Science  
reasoning for a non-solvable system.  ...  Among the automation that emerges are tactics for decomposing hybrid systems, discovering and establishing invariants of nonlinear continuous systems, arithmetic simplifications to maximize the benefit  ...  Tactical Automation for Differential Equations Automated reasoning for ODEs is critical to scalable analysis of hybrid systems.  ... 
doi:10.1007/978-3-319-66107-0_14 fatcat:okhqcrimebhxfmk5374hjwgwsq

Distributed Mils (D-Mils) Specification, Analysis, Deployment, And Assurance Of Distributed Critical Systems

Harald Rueß, Stefano Tonetta
2015 International Conference on High Performance Embedded Architectures and Compilers  
increasing value of t Reduced to invariant checking t Very efficient for finite-state systems t Integrated with IC3 for an incremental check of different n Implemented in nuXmv t Combined with IC3IA  ...  certification of systems built on the platform supported by extensive automation n Enable application architectures to seamlessly span multiple nodes, for scalable determinism n Industrial D-MILS Pilots  ...  Demonstrator: fortiss Smart Microgrid Automatic generation of invariants  ... 
doi:10.5281/zenodo.47985 dblp:conf/hipeac/RuessT15 fatcat:ovbvzpwbarh5dmeckjxa3ru2e4

Specifying and proving properties of timed I/O automata using Tempo

Myla Archer, Hongping Lim, Nancy Lynch, Sayan Mitra, Shinya Umeno
2008 Design automation for embedded systems  
Tempo, for proving system properties, including timing properties.  ...  TIOA can be used for example, to model a real-time software component controlling a physical process. The TIOA model is sufficiently general to subsume other models in use for timed systems.  ...  Acknowledgements We wish to thank the anonymous reviewers of earlier versions of this paper for helpful suggestions for improvements.  ... 
doi:10.1007/s10617-008-9022-2 fatcat:gbt2lm2dg5azpae3ozxoc6j6ya
« Previous Showing results 1 — 15 out of 28,586 results