Sciweavers

852 search results - page 112 / 171
» entcs 2010
Sort
View
ENTCS
2007
75views more  ENTCS 2007»
15 years 13 days ago
Testing Planning Domains (without Model Checkers)
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
Franco Raimondi, Charles Pecheur, Guillaume Brat
83
Voted
ENTCS
2007
98views more  ENTCS 2007»
15 years 13 days ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
107
Voted
ENTCS
2007
107views more  ENTCS 2007»
15 years 13 days ago
Formal Translation of Bytecode into BoogiePL
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
Hermann Lehner, Peter Müller
ENTCS
2007
130views more  ENTCS 2007»
15 years 13 days ago
Specify, Compile, Run: Hardware from PSL
We propose to use a formal specification language as a high-level hardware description language. Formal languages allow for compact, unambiguous representations and yield designs...
Roderick Bloem, Stefan Galler, Barbara Jobstmann, ...
89
Voted
ENTCS
2007
111views more  ENTCS 2007»
15 years 13 days ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski