Filters








973 Hits in 6.9 sec

Symmetric Symbolic Safety-Analysis of Concurrent Software with Pointer Data Structures [chapter]

Farn Wang, Karsten Schmidt
2002 Lecture Notes in Computer Science  
We formally define the model of software with pointer data structures.  ...  We developed symbolic algorithms for the manipulation of conditions and assignments with indirect operands for verification with BDD-like data-structures.  ...  Concurrent Algorithms and the Safety Analysis Problem We consider concurrent algorithms with local data structures attached to each process for convenience of presentation and discussion.  ... 
doi:10.1007/3-540-36135-9_4 fatcat:r3zid5kyerbxpo4knn5ivcdkui

Automatic Verification of Pointer Data-Structure Systems for All Numbers of Processes [chapter]

Farn Wang
1999 Lecture Notes in Computer Science  
We formally model such concurrent software as processes running algorithms on data-structures with pointers. We show that the verification problem of such algorithms is undecidable.  ...  Real-world concurrent software may be implemented with any number of processes which are linked together to form complex and dynamic network configurations.  ...  Acknowledgment I sincerely thank the reviewers of FM'99 whose comments and suggestions have greatly improved the quality of the manuscript.  ... 
doi:10.1007/3-540-48119-2_20 fatcat:snc7tb3webefxmy6ocadzeanra

Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems [chapter]

Farn Wang
2000 Lecture Notes in Computer Science  
A new data-structure called RED (Region-Encoding Diagram) for the fully symbolic model-checking of real-time software systems is proposed.  ...  RED is a BDD-like data-structure for the encoding of regions [2] . Unlike DBM which records differences between pairs of clock readings, RED only uses one auxiliary binary variable for each clock.  ...  Thus our data-structure is perfect for symmetric systems with symmetric specifications.  ... 
doi:10.1007/3-540-46419-0_12 fatcat:ddaisalnpzckbd5cz2setyvqp4

Dynamic Program Analysis [chapter]

Alex Biryukov, Christophe De Cannière, William E. Winkler, Charu C. Aggarwal, Markus Kuhn, Luc Bouganim, Yanli Guo, Bart Preneel, Gerrit Bleumer, Tor Helleseth, Ran Canetti, Mayank Varia (+35 others)
2011 Encyclopedia of Cryptography and Security  
Testing using manually generated test cases is the primary technique used in industry to improve reliability of software-in fact, such ad hoc testing accounts for over half of the typical cost of software  ...  Large real-world programs are almost always concurrent. Because of the inherent nondeterminism of such programs, testing is notoriously hard.  ...  However, their work deals with symbolic execution of numerical programs with floating points, rather than programs with pointers and data-structures.  ... 
doi:10.1007/978-1-4419-5906-5_1352 fatcat:6xfnq4jmxnefphktsrcesjgzdu

Fragment Abstraction for Concurrent Shape Analysis [chapter]

Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh
2018 Lecture Notes in Computer Science  
We present a novel shape analysis for automated verification of fine-grained concurrent algorithms that can handle heap structures which are more complex than just singly-linked lists, in particular skip  ...  lists and arrays of singly linked lists, while at the same time handling an unbounded number of concurrent threads, an unbounded domain of data values (including timestamps), and an unbounded shared heap  ...  Introduction Concurrent algorithms with an unbounded number of threads that concurrently access a dynamically allocated shared state are of central importance in a large number of software systems.  ... 
doi:10.1007/978-3-319-89884-1_16 fatcat:rs765as77ff3fic5tqluzazcdu

dSPIN: A Dynamic Extension of SPIN [chapter]

Claudio Demartini, Radu Iosif, Riccardo Sisto
1999 Lecture Notes in Computer Science  
This article presents a number of language extensions along with their implementation in SPIN.  ...  We carried out a number of experiments and found out that an important expressibility gain can be achieved with at most a small loss of performance.  ...  Introduction It is nowadays a common approach to use concurrent programming along with object-oriented techniques in order to increase robustness and re-usability of concurrent software.  ... 
doi:10.1007/3-540-48234-2_20 fatcat:gzo7zqgojbcelil3tgztrz23hq

Application of the Method for Concurrent Programs Properties Proof to Real-World Industrial Software Systems

Taras Panchenko
2016 International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications  
The method for software properties proof in interleaving concurrent environment with communication via shared memory was developed to solve the problem of simultaneous check the required property over  ...  the family of programs being run arbitrary times in parallel -instead of doing separate proofs for every number of program instances being run concurrently.  ...  program properties proof (particularly safety property or partial correctness) for wide range of industrial software which is executed in interleaving concurrency environment with shared memory interaction  ... 
dblp:conf/icteri/Panchenko16 fatcat:gqymfahyajdvlbhbln4x4iy6mm

Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software [chapter]

Richard Bonichon, Géraud Canet, Loïc Correnson, Eric Goubault, Emmanuel Haucourt, Michel Hirschowitz, Sébastien Labbé, Samuel Mimram
2011 Lecture Notes in Computer Science  
It runs as a plug-in of the Frama-C static analysis platform [11, 17] , which is dedicated to the analysis of software source code written in the C programming language.  ...  This paper reports on the development of a tool-based methodology to address the demonstration of freedom from intrinsic software faults related to concurrency and synchronization, and its practical application  ...  understanding and extract representative models to be analyzed by third-party tools; -ALCOOL: Analysis of coordination in concurrent software -Develop a theory, algorithms and a static analysis tool with  ... 
doi:10.1007/978-3-642-24270-0_7 fatcat:tdyrtjv5tfbc5ex2r2nalufh5u

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.  ...  As the complexity of software systems grew, so did the need for some reasoning mechanism about correct behavior.  ...  HEAP DATA STRUCTURES So far, we have assumed a simple program model where we have ignored the effect of potentially unbounded data structures on the heap.  ... 
doi:10.1145/1592434.1592438 fatcat:hxexhmlpxjbx3hqlfh3o4bzz4u

The design, implementation, and evaluation of Jade

Martin C. Rinard, Monica S. Lam
1998 ACM Transactions on Programming Languages and Systems  
We also nd that the Jade data model can interact poorly with concurrency patterns that write disjoint pieces of a single aggregate data structure, although this problem arises in only one of the applications  ...  This approach eliminates many of the problems that complicate the development of parallel software.  ...  The compiler combines this information with an analysis of the pointer-chain paths that di erent parts of the computation follow to derive a precise estimate of how the computation will access data.  ... 
doi:10.1145/291889.291893 fatcat:hkilkvkmwfhljbnm3rkmzosxgy

ISO-26262 Compliant Safety-Critical Autonomous Driving Applications: Real-Time Interference-Aware Multicore Architectures

Abdullah El-Bayoumi
2021 International Journal of Safety and Security Engineering  
The main objectives of this work are to investigate, evaluate and introduce an efficient safety-critical multi-cache multicore architecture, that is fully compliant with methods and principles of ISO 26262  ...  With the evolutionary trend of safety critical applications, innovative safety design methodologies have raised present requirements constraints and limitations to mitigate such design complexity deviations  ...  The author would like to thank the expert staff of the Research and Development Center of Valeo.  ... 
doi:10.18280/ijsse.110103 fatcat:svaasx55yfbjpgccwkdjsmhix4

A Verified Information-Flow Architecture [article]

Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, Andrew Tolmach
2016 arXiv   pre-print
The operating system virtualizes these generic facilities to present an information-flow abstract machine that allows user programs to label sensitive data with rich confidentiality policies.  ...  Finally, we verify the correctness of this generator using a dedicated Hoare logic that abstracts from low-level machine instructions into a reusable set of verified structured code generators.  ...  In particular, SAFE tags can be pointers to arbitrary data structures in memory.  ... 
arXiv:1509.06503v2 fatcat:ajryc67ilzhqbg2l435lpazaki

Formal Software Analysis Emerging Trends in Software Model Checking

Matthew B. Dwyer, John Hatcliff, Robby Robby, Corina S. Pasareanu, Willem Visser
2007 Future of Software Engineering (FOSE '07)  
In this paper, we define formal software analyses as having several important properties that distinguish them from other forms of software analysis.  ...  His interests cover a wide range of topics in software dependability including: specification methods, static analysis and verification, run-time monitoring and testing.  ...  Recent approaches extend the traditional notion of symbolic execution to handle complex input data structures and concurrency.  ... 
doi:10.1109/fose.2007.6 dblp:conf/icse/DwyerHRPV07 fatcat:ucvmmm75kjbyxluplh5z3y3x4q

Scalable error detection using boolean satisfiability

Yichen Xie, Alex Aiken
2005 SIGPLAN notices  
Our analysis is path sensitive, precise down to the bit level, and models pointers and heap data. Our approach is also highly scalable, which we achieve using two techniques.  ...  We describe a software error-detection tool that exploits recent advances in boolean satisfiability (SAT) solvers.  ...  Acknowledgments We thank Andy Chou for thoughtful discussions and significant contributions to an earlier SAT-based analysis effort.  ... 
doi:10.1145/1047659.1040334 fatcat:ukre2vakyrh6njlrhuemmxiiye

Scalable error detection using boolean satisfiability

Yichen Xie, Alex Aiken
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
Our analysis is path sensitive, precise down to the bit level, and models pointers and heap data. Our approach is also highly scalable, which we achieve using two techniques.  ...  We describe a software error-detection tool that exploits recent advances in boolean satisfiability (SAT) solvers.  ...  Acknowledgments We thank Andy Chou for thoughtful discussions and significant contributions to an earlier SAT-based analysis effort.  ... 
doi:10.1145/1040305.1040334 dblp:conf/popl/XieA05 fatcat:6o6dta32fbd3nm6ebpp3kqx5pe
« Previous Showing results 1 — 15 out of 973 results