Sciweavers

313 search results - page 39 / 63
» Model equivalence of PRISM programs
Sort
View
LFP
1990
102views more  LFP 1990»
13 years 9 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo
ECOOP
2005
Springer
14 years 1 months ago
Open Modules: Modular Reasoning About Advice
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program. Advice can help to make programs m...
Jonathan Aldrich
ICSE
2010
IEEE-ACM
13 years 9 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
ICALP
2009
Springer
14 years 2 months ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
SPAA
2003
ACM
14 years 1 months ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin