Sciweavers

315 search results - page 32 / 63
» Combinational Verification based on High-Level Functional Sp...
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
CIIA
2009
13 years 9 months ago
PNTools: a Multi-Language Environment to Integrate Petri Nets Tools
The power of Petri nets resides on the availability of several tools for analysis and verification of properties of systems. Users have to combine the functionality of tools in dif...
Allaoua Chaoui, Ismail Hadjadj
APSEC
1999
IEEE
14 years 7 days ago
The Quest for Correct Systems: Model Checking of Diagrams and Datatypes
For the practical development of provably correct software for embedded systems the close integration of CASE tools and verification tools is required. This paper describes the co...
Jan Philipps, Oscar Slotosch
CC
2008
Springer
137views System Software» more  CC 2008»
13 years 10 months ago
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
Francesco Logozzo, Manuel Fähndrich
SFP
2004
13 years 9 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig