Sciweavers

949 search results - page 144 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Abstraction in model checking multi-agent systems
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco ...
FROCOS
2007
Springer
14 years 2 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
PASTE
2004
ACM
14 years 2 months ago
Validation of assembler programs for DSPs: a static analyzer
Digital Signal Processors are widely used in critical embedded systems to pilot low-level, often critical functionalities. We describe a static analyzer based on abstract interpre...
Matthieu Martel
CAV
2004
Springer
87views Hardware» more  CAV 2004»
14 years 2 months ago
GSTE Is Partitioned Model Checking
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
Roberto Sebastiani, Eli Singerman, Stefano Tonetta...
CC
1998
Springer
134views System Software» more  CC 1998»
14 years 1 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson