504 search results - page 69 / 101 » Complexity Properties of Restricted Abstract Argument System... |
ENTCS
2008
13 years 7 months ago
2008
Automatic generation of formal specifications from requirement reduces cost and complexity of formal models creation. Thus, the generated formal model brings the possibility to ca...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
HPCN
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. In this paper the design and validation of a high performance simulation is discussed that is of critical value to the feasibility study of the GRAIL project, the aim of ...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...