Sciweavers

9 search results - page 2 / 2
» Predicative Analysis of Feasibility and Diagonalization
Sort
View
HYBRID
2003
Springer
13 years 10 months ago
Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
Ronojoy Ghosh, Ashish Tiwari, Claire Tomlin
ASPLOS
2006
ACM
13 years 11 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 5 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
KBSE
2005
IEEE
13 years 11 months ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...