Sciweavers

159 search results - page 15 / 32
» Automated Result Verification with AWK
Sort
View
DAC
1996
ACM
13 years 11 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Towards Verifying Model Transformations
In model-based software development, a complete design and analysis process involves designing the system using the design language, converting it into the analysis language, and ...
Anantha Narayanan, Gabor Karsai
DAC
2009
ACM
14 years 8 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
FAC
2007
170views more  FAC 2007»
13 years 7 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
CADE
2007
Springer
14 years 7 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt