Sciweavers

597 search results - page 73 / 120
» Formal Techniques for Java-Like Programs
Sort
View
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
14 years 8 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 2 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
ESWS
2006
Springer
13 years 11 months ago
Rules with Contextually Scoped Negation
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
Axel Polleres, Cristina Feier, Andreas Harth
RV
2010
Springer
127views Hardware» more  RV 2010»
13 years 6 months ago
You Should Better Enforce Than Verify
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
Yliès Falcone