Sciweavers

412 search results - page 18 / 83
» Modelling Metamorphism by Abstract Interpretation
Sort
View
SIGSOFT
2004
ACM
14 years 3 months ago
A type system for object models
A type system for object models is described that supports subtypes and allows overloading of relation names. No special features need be added to the modelling language; in parti...
Jonathan Edwards, Daniel Jackson, Emina Torlak
DAC
2003
ACM
14 years 3 months ago
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
Mehrdad Reshadi, Prabhat Mishra, Nikil D. Dutt
FOSSACS
2009
Springer
14 years 4 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
ECAI
1998
Springer
14 years 2 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
ECMDAFA
2007
Springer
156views Hardware» more  ECMDAFA 2007»
14 years 1 months ago
Human Comprehensible and Machine Processable Specifications of Operational Semantics
Abstract. This paper presents a method to describe the operational semantics of languages based on their meta-model. We combine the established high-level modelling languages MOF, ...
Markus Scheidgen, Joachim Fischer