A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Verification of parameterized concurrent programs by modular reasoning about data and control
2012
SIGPLAN notices
Preserved Fulltext
Our approach is based on decomposing the task into two modules, where one reasons about data and the other reasons about control. ...
We demonstrate the effectiveness of our technique by verifying properties of a selection of Linux device drivers using DUET, and also compare DUET with previous work on verification of parameterized Boolean ...
Finally, we thank Alexander Kaiser and Gennaro Parlato for providing the Boolean programs and for their help with running Boom and Getafix. ...
doi:10.1145/2103621.2103693
fatcat:ary2fn4flrcypbw45d5m3tzgti
Verification of parameterized concurrent programs by modular reasoning about data and control
2012
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach is based on decomposing the task into two modules, where one reasons about data and the other reasons about control. ...
We demonstrate the effectiveness of our technique by verifying properties of a selection of Linux device drivers using DUET, and also compare DUET with previous work on verification of parameterized Boolean ...
Finally, we thank Alexander Kaiser and Gennaro Parlato for providing the Boolean programs and for their help with running Boom and Getafix. ...
doi:10.1145/2103656.2103693
dblp:conf/popl/FarzanK12
fatcat:g7gntyj32bcozhucntj2fq7wam
Application of design for verification with concurrency controllers to air traffic control software
2005
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering - ASE '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
This pattern enables a modular verification strategy by decoupling the behaviors of the concurrency controllers from the behaviors of the threads that use them using interfaces specified as finite state ...
We apply the concurrency controller design pattern to the implementation of the synchronization operations in Java programs. ...
The concurrency controller pattern supports a modular verification strategy by identifying the stateful interfaces of concurrency controllers. ...
doi:10.1145/1101908.1101914
dblp:conf/kbse/Betin-CanBLLT05
fatcat:2tyntzbxdng6njlpd2cixc4fza
Highly dependable concurrent programming using design for verification
2006
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a design for verification approach for highly dependable concurrent programming using a design pattern for concurrency controllers. ...
We present an assume-guarantee style modular verification strategy which separates the verification of the controller behavior from the verification of the conformance to its interface. ...
Concurrency controller pattern enables modular verification of concurrency controllers by decoupling their behaviors and interfaces. ...
doi:10.1007/s00165-006-0017-0
fatcat:5lxzrendm5dy7ny4qtn4gtisly
Eliminating synchronization faults in air traffic control software via design for verification with concurrency controllers
2007
Automated Software Engineering : An International Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The concurrency controller design pattern enables a modular verification strategy by decoupling the behaviors of the concurrency controllers from the behaviors of the threads that use them using interfaces ...
We used both infinite and finite state verification techniques for finding the seeded faults. ...
The concurrency controller pattern supports a modular verification strategy by identifying the stateful interfaces of concur-rency controllers. ...
doi:10.1007/s10515-007-0008-2
fatcat:36po53h5tjh7lau6zqw4s6m3rm
Modular verification of synchronization with reentrant locks
2010
Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. ...
Our approach decouples the verification of the lock implementation from the verification of the threads that use the lock. ...
It is especially difficult to control the behavior of shared variables that can be accessed and modified by multiple threads. ...
doi:10.1109/memcod.2010.5558623
dblp:conf/memocode/BultanYB10
fatcat:3b4fc5usfjgkppjdh3vu7vwp5m
Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)
2013
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of the Dagstuhl Seminar 12461 "Games and Decisions for Rigorous Systems Engineering". ...
This event was the first seminar of this kind and a kickoff of a series of seminars organised on rigorous systems engineering. ...
Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. ...
doi:10.4230/dagrep.2.11.45
dblp:journals/dagstuhl-reports/BjornerCKM12
fatcat:gs36midqlvfhzky6v7ebawumtq
Thread modularity at many levels: a pearl in compositional verification
2017
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We accommodate the control flow of P (n) by treating program locations as data in P [n]. ...
The classical approach to verification of concurrent programs uses a different, modular, approach. ...
doi:10.1145/3009837.3009893
fatcat:ogunj47nqrafzltjdo35ask4wi
TACAS 2003 Special Issue—Preface
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Compositional analysis for parameterized systems: Many safety critical systems that have been considered by the verification community are parameterized by the number of concurrent components in the system ...
program analysis and verification engines. ...
Conclusion We would like to thank heartily the referees for their expertise and their commitment to the quality of the present special issue. ...
doi:10.1016/j.tcs.2005.11.014
fatcat:wayjlqolubgvpkwhidau222pha
Modular verification of concurrent assembly code with dynamic thread creation and termination
2005
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming - ICFP '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Recently Yu and Shao proposed a logic-based "type" system for verifying concurrent assembly programs. ...
Our work provides a foundation for certifying realistic multi-threaded programs and makes an important advance toward generating proofcarrying concurrent code. ...
This research is based on work supported in part by grants from Intel and Microsoft, and NSF grant CCR-0208618. ...
doi:10.1145/1086365.1086399
dblp:conf/icfp/FengS05
fatcat:inrelnvnrfg5jnpvqhjgi6opeq
Gobra: Modular Specification and Verification of Go Programs (extended version)
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. ...
This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives. ...
This project has received funding from the European Union's Horizon 2020 research and innovation program within the framework of the NGI-POINTER Project funded under grant agreement No 871528. ...
arXiv:2105.13840v1
fatcat:2qvkaz5c4ngsvoywt4uvju6y6q
Modular verification of concurrent assembly code with dynamic thread creation and termination
2005
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Recently Yu and Shao proposed a logic-based "type" system for verifying concurrent assembly programs. ...
Our work provides a foundation for certifying realistic multi-threaded programs and makes an important advance toward generating proofcarrying concurrent code. ...
This research is based on work supported in part by grants from Intel and Microsoft, and NSF grant CCR-0208618. ...
doi:10.1145/1090189.1086399
fatcat:p4nlpuqievaglnjwkrusfx7vey
Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we present Aneris, a novel framework based on separation logic supporting modular, node-local reasoning about concurrent and distributed systems. ...
The two examples certify that Aneris is well-suited for both horizontal and vertical modular reasoning. ...
This research was carried out while Amin Timany was at KU Leuven, working as a postdoctoral fellow of the Flemish research fund (FWO). ...
doi:10.1007/978-3-030-44914-8_13
fatcat:ledgihizhncsnltkcudmbxmne4
Page 2064 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “The paper introduces a compositional Hoare logic for reasoning about the partial correctness and absence of deadlock of a certain class of programs. ...
We present symbolic procedures, and corresponding termination criteria, for the solution of infinite-state games, which occur in the control and modular verification of infinite-state systems. ...
PhD Abstracts
2019
Journal of functional programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. ...
Many students complete PhDs in functional programming each year. ...
By talking about the surroundings of programs, control operators enable sophisticated manipulation of control flow, yielding a wide range of practical applications. ...
doi:10.1017/s0956796819000078
fatcat:nqlt4e66r5ea5ibvngbewqpvs4
« Previous
Showing results 1 — 15 out of 2,382 results