Filters








139,954 Hits in 4.7 sec

Invariant Checking for Programs with Procedure Calls [chapter]

Guillem Godoy, Ashish Tiwari
2009 Lecture Notes in Computer Science  
We explore the theoretical limits for doing automatic invariant checking and show that invariant checking is decidable for a large class of programs that includes some recursive programs.  ...  Removing some of the restrictions on the program model leads to undecidability of the invariant checking problem.  ...  We thank the reviewers for their helpful comments. References  ... 
doi:10.1007/978-3-642-03237-0_22 fatcat:vi3l2taxjvh7ze6tnvgb7b5y5i

Refinement for Structured Concurrent Programs [chapter]

Bernhard Kragl, Shaz Qadeer, Thomas A. Henzinger
2020 Lecture Notes in Computer Science  
This paper presents a foundation for refining concurrent programs with structured control flow.  ...  The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation.  ...  RefPL provides a single call statement for calling any number (including zero) of procedures and yield invariants in parallel.  ... 
doi:10.1007/978-3-030-53288-8_14 fatcat:z7qgrvgrljempey635z2osobti

Automated and Modular Refinement Reasoning for Concurrent Programs [chapter]

Chris Hawblitzel, Erez Petrank, Shaz Qadeer, Serdar Tasiran
2015 Lecture Notes in Computer Science  
We present civl, a language and verifier for concurrent programs based on automated and modular refinement reasoning. civl supports reasoning about a concurrent program at many levels of abstraction.  ...  Modular specifications and proof annotations, such as location invariants and procedure pre-and post-conditions, are specified separately, independently at each level in terms of the variables visible  ...  of call P for P ∈ dom(RS ) with call RS (P ).  ... 
doi:10.1007/978-3-319-21668-3_26 fatcat:n2eslalhbzfbtbeplhbj65pwju

Differential assertion checking

Shuvendu K. Lahiri, Kenneth L. McMillan, Rahul Sharma, Chris Hawblitzel
2013 Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013  
In particular, we leverage automatic invariant generation to synthesize relative specifications for pairs of loops and procedures.  ...  In this paper, we describe the approach of differential assertion checking (DAC) for comparing different versions of a program with respect to a set of assertions.  ...  For static assertion checking, these include the need to define an assertion (or specification) to check, to provide environment specifications and to provide auxiliary invariants for loops and Permission  ... 
doi:10.1145/2491411.2491452 dblp:conf/sigsoft/LahiriMSH13 fatcat:roatt344q5hpxnslazzkrpwhsm

A Modular Checker for Multithreaded Programs [chapter]

Cormac Flanagan, Shaz Qadeer, Sanjit A. Seshia
2002 Lecture Notes in Computer Science  
To handle realistic programs, Calvin performs modular checking of each procedure called by a thread using specifications of other procedures and other threads.  ...  We have built a scalable and expressive static checker called Calvin for multithreaded programs.  ...  Moreover, these tools cannot verify invariants or check refinement of abstractions. Recently, a few tools for checking invariants on multithreaded programs have appeared.  ... 
doi:10.1007/3-540-45657-0_14 fatcat:mlqijrukbreereaij3ujjawnrm

Modular Checking with Model Checking

Yuusuke Hashimoto, Shin Nakajima
2009 Electronical Notes in Theoretical Computer Science  
Scalability can be achieved with the notions of Design by Contract(DbC) and modular checking. However, modular checking with DbC still have some problems.  ...  The method is insufficient for handling pointers to functions (function-pointers) which are abundantly used in C programs, defensive programming which is widely adopted in industrial software development  ...  Application of model checking to programs (modern model checking) has further problems, such as handling data values, procedure calls and so on.  ... 
doi:10.1016/j.entcs.2009.09.062 fatcat:fjw5avugkfav5jkzfbgfieo3hu

Crosscutting techniques in program specification and analysis

Patrick Lam, Viktor Kuncak, Martin Rinard
2005 Proceedings of the 4th international conference on Aspect-oriented software development - AOSD '05  
Our experience indicates that aspect-oriented concepts can also be extremely useful for specification, analysis, and verification.  ...  We present three aspect-oriented constructs (formats, scopes, and defaults) that, in combination with a specification language based on abstract sets of objects, enable the modular application of multiple  ...  A simple link-time check (similar to the link time check for reentrant call sites) would verify the correctness of the scope invariant usage information.  ... 
doi:10.1145/1052898.1052913 dblp:conf/aosd/LamKR05 fatcat:bx7vej43czg7nmjuogxlxdkolm

Intra-module Inference [chapter]

Shuvendu K. Lahiri, Shaz Qadeer, Juan P. Galeotti, Jan W. Voung, Thomas Wies
2009 Lecture Notes in Computer Science  
Therefore, we consider the problem of intra-module inference, which aims to infer annotations for internal procedures and loops, given the interface specification and the module invariant.  ...  However, it is difficult to apply such checkers to large program modules because they require programmers to provide detailed contracts, including an interface specification, a module invariant, and internal  ...  Acknowledgments We wish to thank Aditya Nori, Julien Vanegue and the anonymous reviewers for their detailed comments.  ... 
doi:10.1007/978-3-642-02658-4_37 fatcat:fvodlxjmkvcmjbjltmhvtth43e

Call Invariants [chapter]

Shuvendu K. Lahiri, Shaz Qadeer
2011 Lecture Notes in Computer Science  
Our approach allows us to leverage existing techniques for reasoning about call-free programs to precisely and predictably reason about programs with procedure calls.  ...  The centerpiece of our approach is the call invariant, a new annotation for procedure calls.  ...  The call invariant R (specified using cinv R) is checked as a loop invariant for this loop; any occurrence of old(X) is replaced with copy X pre , the value of X just before the procedure call.  ... 
doi:10.1007/978-3-642-20398-5_18 fatcat:pejom4b44zbeljzoknmgcul4qi

Checking Observational Purity of Procedures [chapter]

Himanshu Arora, Raghavan Komondoor, G. Ramalingam
2019 Lecture Notes in Computer Science  
Our approach encodes the procedure's code as a logical formula, with recursive calls being modeled using a mathematical function symbol assuming that the procedure is observationally pure.  ...  Then, a theorem prover is invoked to check whether this logical formula agrees with the function symbol referred to above in terms of input-output behavior for all arguments.  ...  Let denote a call-site or the procedure-exit. We need to check that ϕ ⇒ ϕ inv holds.  ... 
doi:10.1007/978-3-030-16722-6_13 fatcat:ik4lyqn2ujcazfuwzi56q77v4q

Checking Observational Purity of Procedures [article]

Himanshu Arora Indian Institute of Science, Bangalore
2019 arXiv   pre-print
Then, a theorem prover is invoked to check whether the formula that has been constructed agrees with the function symbol referred to above in terms of input-output behavior for all arguments.  ...  Our approach involves encoding the procedure's code as a formula that is a disjunction of path constraints, with the recursive calls being replaced in the formula with references to a mathematical function  ...  Let ℓ denote a call-site or the procedure-exit. We need to check that ϕ ℓ ⇒ ϕ inv holds.  ... 
arXiv:1902.05436v1 fatcat:4smnee3dmfdkhp4jdc25667vyq

Towards Scalable Modular Checking of User-Defined Properties [chapter]

Thomas Ball, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer, Julien Vanegue
2010 Lecture Notes in Computer Science  
We present a case study of applying a modular checker HAVOC to check properties about the synchronization protocol of a core Microsoft Windows component with more than 300,000 lines of code and 1500 procedures  ...  We describe our experience in using a modular checker to create various property checkers for finding errors in a well-tested application of this scale, and our design decisions to find them with low false  ...  They use a theorem prover to perform precise intraprocedural analysis for loop-free and call-free programs, in the presence of contracts for loop and called procedures. 3.  ... 
doi:10.1007/978-3-642-15057-9_1 fatcat:ysq3ug6xffbzrbqxnk65tp542a

Program analysis for compiler validation

Anna Zaks, Amir Pnueli
2008 Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '08  
In addition, we present a novel invariant generation algorithm which strengthens our analysis when the input programs contain dynamically allocated data structures.  ...  In this paper, we show how to adapt the existing program analysis techniques in the setting of translation validation.  ...  We use Pi( x, & z) to denote the signature of a procedure. Here, call-by-value parameter passing method is used for x, and call-by-reference is used for z.  ... 
doi:10.1145/1512475.1512477 dblp:conf/paste/ZaksP08 fatcat:x6yrtqtrc5fgjfk4zmluzgc7si

Artemis

Long Fei, Samuel P. Midkiff
2006 Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06  
Our experimental results show that Artemis applied to a hardware-based PC-invariance monitoring scheme and a value-based invariance detection and checking scheme significantly improves their runtime monitoring  ...  overhead (by up to 4.6 times) with moderate impact on their bug-detecting capabilities.  ...  We thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1133981.1133992 dblp:conf/pldi/FeiM06 fatcat:h3i7sx4ftzcyfkyc6aenb3czgq

Artemis

Long Fei, Samuel P. Midkiff
2006 SIGPLAN notices  
Our experimental results show that Artemis applied to a hardware-based PC-invariance monitoring scheme and a value-based invariance detection and checking scheme significantly improves their runtime monitoring  ...  overhead (by up to 4.6 times) with moderate impact on their bug-detecting capabilities.  ...  We thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1133255.1133992 fatcat:c3lrwyispncqzp67dazi2rmjde
« Previous Showing results 1 — 15 out of 139,954 results