Sciweavers

2520 search results - page 132 / 504
» Model-checking behavioral programs
Sort
View
110
Voted
JUCS
2006
126views more  JUCS 2006»
15 years 1 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins
CIE
2009
Springer
15 years 7 months ago
Stochastic Programs and Hybrid Automata for (Biological) Modeling
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
Luca Bortolussi, Alberto Policriti
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 4 months ago
Characterizing a Tunably Difficult Problem in Genetic Programming
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo...
218
Voted
POPL
2005
ACM
16 years 1 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
180
Voted
SIGSOFT
2010
ACM
14 years 11 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay