Filters








68 Hits in 7.5 sec

Why does Astrée scale up?

Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, Xavier Rival
2009 Formal methods in system design  
We discuss the way the precision of the semantics was tuned in ASTRÉE in order to scale up, the differences with some more academic approaches and some of the dead-ends we explored.  ...  What makes ASTRÉE such an innovative tool is its scalability, while retaining the required precision, when it is used to analyze a specific class of programs: that of reactive control-command software.  ...  In particular, due to our full context-sensitive control abstraction (Sect. 5.1), the set of existing memory locations at each abstract control point can be determined statically: it is the set of global  ... 
doi:10.1007/s10703-009-0089-6 fatcat:lf5bl7rtznfjtlriqu62gvs35m

Semantic Reduction of Thread Interleavings in Concurrent Programs [chapter]

Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupta
2009 Lecture Notes in Computer Science  
We use abstract interpretation to automatically derive program invariants, based on abstract domains of increasing precision.  ...  We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques.  ...  In practice, we use abstract domains of increasing precision ranges, octagons, and polyheda to derive more accurate invariants. Algorithm 2.  ... 
doi:10.1007/978-3-642-00768-2_12 fatcat:bg5fn4ju4bdabp7kbapzrkmzre

Static Analysis and Verification of Aerospace Software by Abstract Interpretation

Julien Bertrane, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, Xavier Rival
2015 Foundations and Trends® in Programming Languages  
We discuss the principles of static analysis by abstract interpretation and report on the automatic verification of the absence of runtime errors in large embedded aerospace software by static analysis  ...  Future research directions on abstract interpretation are also discussed in the context of aerospace software.  ...  The development of a sound, precise, and scalable static analyzer is a long-term effort.  ... 
doi:10.1561/2500000002 fatcat:qexzhfzrlvhh7eghzfo76ezca4

Software model checking

Ranjit Jhala, Rupak Majumdar
2009 ACM Computing Surveys  
Software model checking is the algorithmic analysis of programs to prove properties of their executions.  ...  It traces its roots to logic and theorem proving, both to provide the conceptual framework in which to formalize the fundamental questions and to provide algorithmic procedures for the analysis of logical  ...  We thank Jay Misra and Tony Hoare for encouraging us to write this survey and several useful comments along the way.  ... 
doi:10.1145/1592434.1592438 fatcat:hxexhmlpxjbx3hqlfh3o4bzz4u

Static Analysis of Embedded Real-Time Concurrent Software with Dynamic Priorities

Antoine Miné
2017 Electronical Notes in Theoretical Computer Science  
This analysis was integrated into the Astrée industrial-scale static analyzer, deployed in avionics and automotive industries.  ...  We show how our analysis can be refined through partitioning in order to take into account the real-time hypothesis, remove spurious interleavings, and gain precision on programs that rely on priorities  ...  to determine whether the increase in precision is significant and whether the analysis retains its scalability.  ... 
doi:10.1016/j.entcs.2017.02.002 fatcat:flf6ltmdnfdu7kd7lvlywjvxgi

Static Analysis of Run-Time Errors in Embedded Real-Time Parallel C Programs

Antoine Miné, Frank Piessens
2012 Logical Methods in Computer Science  
We present a static analysis by Abstract Interpretation to check for run-time errors in parallel and multi-threaded C programs.  ...  We present preliminary experimental results analyzing an industrial program with our prototype, Th\'es\'ee, and demonstrate the scalability of our approach.  ...  Acknowledgement We wish to thank the ESOP'11 and LMCS anonymous reviewers as well as David Pichardie for their helpful comments on several versions of this article.  ... 
doi:10.2168/lmcs-8(1:26)2012 fatcat:4tzntfjurrfvhbqszyc33yykey

Multi-core Reachability for Timed Automata [chapter]

Andreas E. Dalsgaard, Alfons Laarman, Kim G. Larsen, Mads Chr. Olesen, Jaco van de Pol
2012 Lecture Notes in Computer Science  
Acknowledgments We would like to thank the LTSmin and APRON developers for making their excellent code available to others in the research community.  ...  It should be clear that they are each increasingly more precise: the sign domain, the interval domain, the difference bounded matrices domain and finally the octagon domain.  ...  Introduction The formal connections and similarities between model checking and static analysis are well known and have been explored by both Schmidt and Steffen [92] , viewing static analysis as a model  ... 
doi:10.1007/978-3-642-33365-1_8 fatcat:qwhq3mr2bzfizm54xhsw7ddd5a

Dual analysis for proving safety and finding bugs

Corneliu Popeea, Wei-Ngan Chin
2013 Science of Computer Programming  
In this paper, we propose a dual static analysis that is based only on over-approximation.  ...  We have proven the soundness of our approach and have implemented a prototype system that is validated by a set of experiments.  ...  We thank the anonymous reviewers for pointers to closely related work and insightful comments that strengthened our paper.  ... 
doi:10.1016/j.scico.2012.07.004 fatcat:odlhu7bzhvbfbit5rxwl3atjm4

Dual analysis for proving safety and finding bugs

Corneliu Popeea, Wei-Ngan Chin
2010 Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10  
In this paper, we propose a dual static analysis that is based only on over-approximation.  ...  We have proven the soundness of our approach and have implemented a prototype system that is validated by a set of experiments.  ...  We thank the anonymous reviewers for pointers to closely related work and insightful comments that strengthened our paper.  ... 
doi:10.1145/1774088.1774538 dblp:conf/sac/PopeeaC10 fatcat:kjmd2ph2w5c37ka3ws4n55o424

Loop summarization using state and transition invariants

Daniel Kroening, Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich, Christoph M. Wintersteiger
2012 Formal methods in system design  
This allows for an effective exploitation of problemspecific abstract domains for summarization and, as a consequence, the precision of an abstract model may be tailored to specific verification needs.  ...  Also, our light-weight termination analysis is demonstrated to be effective on a wide range of benchmarks, including OS device drivers.  ...  of the analysis for scalability.  ... 
doi:10.1007/s10703-012-0176-y fatcat:2mbdjpgqebfgxpjjfptuavj5ru

Synthesising Interprocedural Bit-Precise Termination Proofs (extended version) [article]

Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel, Björn Wachter
2015 arXiv   pre-print
Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination.  ...  Our experimental results show that our tool 2LS outperforms state-of-the-art alternatives, and demonstrate the clear advantage of interprocedural reasoning over monolithic analysis in terms of efficiency  ...  In addition to [33] , we consider context-sensitive analysis, underapproximate backwards analysis, and make the interaction with termination analysis explicit.  ... 
arXiv:1505.04581v1 fatcat:4e6whaznabc5dimy5bhf4e2dre

Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation

Piotr Mardziel, Stephen Magill, Michael Hicks, Mudhakar Srivatsa
2013 Journal of Computer Security  
We implement query analysis and belief tracking via abstract interpretation, which allows us to trade off precision and performance through the use of abstraction.  ...  We have developed an approach to augment standard abstract domains to include probabilities, and thus define distributions.  ...  Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001.  ... 
doi:10.3233/jcs-130469 fatcat:xujrukivkfhypbagdrcpyyltsi

Analysis and Transformation of Constrained Horn Clauses for Program Verification

EMANUELE DE ANGELIS, FABIO FIORAVANTI, JOHN P. GALLAGHER, MANUEL V. HERMENEGILDO, ALBERTO PETTOROSSI, MAURIZIO PROIETTI
2021 Theory and Practice of Logic Programming  
This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems.  ...  Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants.  ...  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti are members of the INdAM Research Group GNCS.  ... 
doi:10.1017/s1471068421000211 fatcat:zfzmqjuozzd5dlfgog7kfmxhce

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
2021 arXiv   pre-print
This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems.  ...  Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants.  ...  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti are members of the INdAM Research Group GNCS.  ... 
arXiv:2108.00739v1 fatcat:gevl2xlor5hrzentqc77irt6gu

Message from the general chair

Benjamin C. Lee
2015 2015 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)  
Learning-based Multi-Sieve Co-reference Resolution with Knowledge Lev Ratinov and Dan Roth Saturday 11:00am-11:30am -202 A (ICC) We explore the interplay of knowledge and structure in co-reference resolution  ...  Traditional merging methods adopt different strategies such as the best-first method and enforcing the transitivity constraint, but most of these methods are used independently of the pairwise learning  ...  Zhou p. 120 A Context-sensitive, Multifaceted Model of Lexico-Conceptual Affect T.  ... 
doi:10.1109/ispass.2015.7095776 dblp:conf/ispass/Lee15 fatcat:ehbed6nl6barfgs6pzwcvwxria
« Previous Showing results 1 — 15 out of 68 results