Sciweavers

5128 search results - page 370 / 1026
» When Abstraction Fails
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 7 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
JSS
2008
89views more  JSS 2008»
15 years 7 months ago
A search-based framework for automatic testing of MATLAB/Simulink models
Search-based test-data generation has proved successful for code-level testing but almost no search-based work has been carried out at evels of abstraction. In this paper the appl...
Yuan Zhan, John A. Clark
ENTCS
2002
125views more  ENTCS 2002»
15 years 7 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
IANDC
1998
70views more  IANDC 1998»
15 years 7 months ago
The Generating Power of Total Deterministic Tree Transducers
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
Sebastian Maneth
ICFEM
2010
Springer
15 years 6 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...