Sciweavers

313 search results - page 23 / 63
» Model equivalence of PRISM programs
Sort
View
TLCA
1995
Springer
13 years 11 months ago
Typed Operational Semantics
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
Healfdene Goguen
TCS
2010
13 years 6 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
ICALP
2009
Springer
14 years 8 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
ICSM
2006
IEEE
14 years 1 months ago
Using Sex Differences to Link Spatial Cognition and Program Comprehension
Spatial cognition and program development have both been examined using contrasting models. We suggest that sex-based differences in one’s perception of risk is the key to relat...
Maryanne Fisher, Anthony Cox, Lin Zhao
ICLP
2009
Springer
14 years 8 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski