656,465 Hits in 6.9 sec

Complexity of Model-Checking Call-by-Value Programs [chapter]

Takeshi Tsukada, Naoki Kobayashi
2014 Lecture Notes in Computer Science  
This paper studies the complexity of the reachability problem (a typical and practically important instance of the model-checking problem) for simply-typed call-by-value programs with recursion, Boolean  ...  Thus, unlike in the call-by-name case, the order of the input program does not serve as a good measure of the complexity. (2) Instead, the depth of types is an appropriate measure: the reachability problem  ...  This work is partially supported by JSPS KAKENHI Grant Number 23220001.  ... 
doi:10.1007/978-3-642-54830-7_12 fatcat:t6bsydwxv5evddhdy2apo3yfcy

Analysis of Boolean Programs [chapter]

Patrice Godefroid, Mihalis Yannakakis
2013 Lecture Notes in Computer Science  
Boolean programs are a popular abstract domain for static-analysisbased software model checking. Yet little is known about the complexity of model checking for this model of computation.  ...  Therefore, the program complexity of model checking for Boolean programs does not follow directly from prior work on model checking for pushdown systems.  ...  Research partially supported by NSF Grant CCF-1017955. References  ... 
doi:10.1007/978-3-642-36742-7_16 fatcat:vdppbznafzcoriitw235mwqt2q

Counterexample Guided Abstraction Refinement Via Program Execution [chapter]

Daniel Kroening, Alex Groce, Edmund Clarke
2004 Lecture Notes in Computer Science  
checking to a much wider array of programs than current tools can handle, in the case of programs containing errors.  ...  Explicit-state model checkers making use of states and operational semantics closely related to actual program execution have dealt with complex data types and semantic issues successfully, but do not  ...  a combination of Bounded Model Checking and program execution.  ... 
doi:10.1007/978-3-540-30482-1_23 fatcat:i4z5jwnltrc3zc7km4u6yphdui

Automated techniques for higher-order program verification

Naoki KOBAYASHI, Luke ONG, David Van HORN
2013 Progress in Informatics  
Studies of game semantics have yielded compositional model checkers and automated program equivalence checkers for Algol-like programming languages, and studies of higher-order recursion schemes and pushdown  ...  automata have yielded model checkers for higher-order functional programs.  ...  Higher-order Call-by-value Software Verification Luca Paolini (Università di Torino) An extension of the call-by-value lambda-calculus with reductions to manage call-by-value effects is presented.  ... 
doi:10.2201/niipi.2013.10.9 fatcat:xqfyvx6m25d4jcodwl373vlxlq

Tight WCRT analysis of synchronous C programs

Partha S. Roop, Sidharta Andalam, Reinhard von Hanxleden, Simon Yuan, Claus Traulsen
2009 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '09  
In this paper, we present an approach for the accurate estimation of the exact WCRT value of a synchronous program, called its tight WCRT value, using model checking.  ...  While a plethora of techniques exist for worst case execution time (WCET) analysis of procedural programs, there are only a handful of techniques for determining the WCRT value of synchronous programs.  ...  Acknowledgement Partha S Roop's research was supported by research and study leave from Auckland University and a research fellowship for experienced researchers from the Alexander von Humboldt foundation  ... 
doi:10.1145/1629395.1629424 dblp:conf/cases/RoopAHYT09 fatcat:gqbq3wiedzh5rozuqp5ujan7ue

Program Model Checking Using Design-for-Verification: NASA Flight Software Case Study

Lawrence Z. Markosian, Masoud Mansouri-Samani, Peter C. Mehlitz, Tom Pressburger
2007 2007 IEEE Aerospace Conference  
Program model checking is a technique for model checking software in which the program itself is the model to be checked.  ...  The case study helps validate the applicability of program model checking technology to real NASA flight software.  ...  ACKNOWLEDGEMENTS The research and development reported here was conducted in the NASA Ames Research Center's Robust Software Engineering group, headed by Dr. Michael Lowry.  ... 
doi:10.1109/aero.2007.352767 fatcat:ksepsaywt5fa7lg3mdznkaq7dm

A tool for modeling form type check constraints and complex functionalities of business applications

Ivan Lukovic, Aleksandar Popovic, Jovo Mostic, Sonja Ristic
2010 Computer Science and Information Systems  
It also provides conceptual modeling of business applications. In the paper, we present new concepts and a tool embedded into IIS*Case, that is aimed at supporting specification of check constraints.  ...  Also, we present concepts and a tool that is aimed at supporting specification of complex (i.e. "nonstandard") functionalities of business applications.  ...  Acknowledgment A part of the research presented in this paper was supported by Ministry of Science and Technological Development of Republic of Serbia, Grant TR-13029, Title: A Development of an Intelligent  ... 
doi:10.2298/csis1002359l fatcat:j3q5rayshfcqfd2zihpzybgiea


Shaz Qadeer, Dinghao Wu
2004 Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04  
Traditional automated techniques for finding errors in concurrent programs, such as model checking, explore all possible thread interleavings.  ...  Since the number of thread interleavings increases exponentially with the number of threads, such analyses have high computational complexity.  ...  implementation of KISS.  ... 
doi:10.1145/996841.996845 dblp:conf/pldi/QadeerW04 fatcat:bvfr2weslfeyvjk3q2khqgg5ky


Shaz Qadeer, Dinghao Wu
2004 SIGPLAN notices  
Traditional automated techniques for finding errors in concurrent programs, such as model checking, explore all possible thread interleavings.  ...  Since the number of thread interleavings increases exponentially with the number of threads, such analyses have high computational complexity.  ...  implementation of KISS.  ... 
doi:10.1145/996893.996845 fatcat:qxwskrtkifa7bhkzadqvypmzw4

Specifying and checking component usage

Steven P. Reiss
2005 Proceedings of the Sixth sixth international symposium on Automated analysis-driven debugging - AADEBUG'05  
Unlike previous systems, CHET is able to check a wide range of complex conditions in large software systems without programmer intervention.  ...  This paper explores the specification techniques that are used in CHET and how they are able handle the types of specifications needed to accurately model and automatically identify component checks.  ...  We generate an abstract program with calls, synchronized blocks, and events. This lets us handle complex and recursive programs easily and compactly.  ... 
doi:10.1145/1085130.1085133 dblp:conf/aadebug/Reiss05 fatcat:dpgil7awvnapxkc5nk4ezd4uoq

Model checking erlang programs

Lars-Åke Fredlund, Clara Benac Earle
2006 Proceedings of the 2006 ACM SIGPLAN workshop on Erlang - ERLANG '06  
to properly diagnose program bugs discovered by the model checker.  ...  The drawback of writing the model checker in Erlang is, potentially, severely reduced performance compared with model checking tools programmed in programming languages which permit destructive updates  ...  To avoid having to modify Erlang we opted instead to modify the program to check; to replace in the source code calls to functions with side-effects with calls to the runtime system of the model checker  ... 
doi:10.1145/1159789.1159793 dblp:conf/erlang/FredlundE06 fatcat:j4hal6nlkvdqbiph266bahqs5a

Checking Event-Based Specifications in Java Systems

Steven P. Reiss
2006 Electronical Notes in Theoretical Computer Science  
It does this by doing a complete and detailed flow analysis of the software and using this analysis to build a simpler, model program.  ...  CHET is able to check a wide range of complex conditions in large software systems without programmer intervention.  ...  . • Exit a routine (return or end of program) (Exit). • Call a routine (Call). • Generate an event for the particular property being checked (Event). • Set a variable or return value to a given value (  ... 
doi:10.1016/j.entcs.2006.01.008 fatcat:qvvadapqafha7jqiwabaxhci2e

A New Approach for Concurrent Program Slicing [chapter]

Pierre Rousseau
2006 Lecture Notes in Computer Science  
Regarding the progress made in model analysis, more complex models, and consequently more complex programs can now be analyzed.  ...  can take advantage of program slicing for reducing the analyzed program complexity.  ...  check and also by removing a lot of complexity from these programs.  ... 
doi:10.1007/11888116_18 fatcat:xyzqfv6mxjagngouucdfsskaw4

Verification of C++ Flight Software with the MCP Model Checker

S. Thompson, G. Brat
2008 IEEE Aerospace Conference. Proceedings  
With this work we are proposing to address the issue by developing a suite of tools that can be used to verify C++ code.  ...  The Constellation project at NASA calls for designing a Crew Exploration Vehicle (Orion, also called CEV) and Cargo Launch Vehicle (Ares, also called CLV).  ...  For example, Bandera [18] provides model checking of Java programs by translating automatically the program into a Promela [2] , PVS [19] or SMV [9] model.  ... 
doi:10.1109/aero.2008.4526577 fatcat:i54z3xccznanzkui3ystzqahza

Combining Model Checking and Testing [chapter]

Patrice Godefroid, Koushik Sen
2018 Handbook of Model Checking  
This chapter presents an overview of this strand of software model checking.  ...  One way to do this consists of adapting model checking into a form of systematic testing that is applicable to industrial-size software.  ...  In practice, however, the verification guarantees provided by model checking are often limited: model checking checks only a program, or a manually-written model of a program, for some specific properties  ... 
doi:10.1007/978-3-319-10575-8_19 fatcat:o7z7rus4ebesdlatlvgockypjy
« Previous Showing results 1 — 15 out of 656,465 results