Sciweavers

4340 search results - page 395 / 868
» Formal Methods and Cryptography
Sort
View
FMCAD
2004
Springer
16 years 6 days ago
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A...
FMCO
2004
Springer
105views Formal Methods» more  FMCO 2004»
16 years 5 days ago
Program Generation and Components
Abstract. The first part of the paper gives a brief overview of metaprogramming, in particular program generation, and its use in software development. The second part introduces ...
Davide Ancona, Eugenio Moggi
ISOLA
2004
Springer
16 years 5 days ago
On the Correctness of Transformations in Compiler Back-Ends
This paper summarizes the results on the correctness of the transformations in compiler back-ends achieved in the DFG-project Verifix. Compiler back-ends transform intermediate la...
Wolf Zimmermann
ECBS
2003
IEEE
146views Hardware» more  ECBS 2003»
16 years 3 days ago
Architecture-Based Design of Computer Based Systems
This paper presents a practical approach to architecture-based design of computer based systems. The approach is discussed in relation to other existing of performing discovery, a...
Mark Denford, Tim O'Neill, John Leaney
AGTIVE
2003
Springer
16 years 1 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman