Sciweavers

1941 search results - page 246 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
WADT
1998
Springer
15 years 7 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...
127
Voted
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
15 years 2 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
DLOG
2009
15 years 1 months ago
Explaining by Example: Model Exploration for Ontology Comprehension
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
Johannes Bauer, Ulrike Sattler, Bijan Parsia
ICFP
2005
ACM
16 years 3 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
EUC
2004
Springer
15 years 9 months ago
Construction of Distributed Object Group Framework and Its Execution Analysis Using Distributed Application Simulation
The Distributed Object Group Framework(DOGF) we constructed supports the grouping of distributed objects that are required for distributed application. From the DOGF, we manage dis...
Chang-Sun Shin, Chang-Won Jeong, Su-Chong Joo