Sciweavers

3045 search results - page 358 / 609
» Formal Approaches to Software Architecture
Sort
View
FMCAD
2008
Springer
15 years 8 months ago
A Write-Based Solver for SAT Modulo the Theory of Arrays
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...
164
Voted
ET
1998
99views more  ET 1998»
15 years 6 months ago
A Behavior Model for Next Generation Test Systems
Defining information required by automatic test systems frequently involves a description of system behavior. To facilitate capturing the required behavior information in the cont...
Lee A. Shombert, John W. Sheppard
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 5 months ago
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
POPL
2010
ACM
16 years 4 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen
FSTTCS
2007
Springer
16 years 29 days ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd