Sciweavers

1463 search results - page 193 / 293
» Model Checking Implicit-Invocation Systems
Sort
View
ATAL
2008
Springer
15 years 3 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
KBSE
2000
IEEE
15 years 5 months ago
Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer
Lightweight formal modeling and automatic analysis were used to explore the design of the Intentional Naming System (INS), a new scheme for resource discovery in a dynamic network...
Sarfraz Khurshid, Daniel Jackson
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
14 years 4 months ago
Querying contract databases based on temporal behavior
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
Elio Damaggio, Alin Deutsch, Dayou Zhou
ACSD
2006
IEEE
154views Hardware» more  ACSD 2006»
15 years 7 months ago
Concurrency in Distributed Systems under Autonomous and Enforced Actions
Recently, the formal approach of I–Systems has been newly hed through an abstract axiomatic system where events in system components are solely derived and defined from their b...
Arnim Wedig, Horst F. Wedde, Anca M. Lazarescu, El...
ICCAD
2002
IEEE
176views Hardware» more  ICCAD 2002»
15 years 10 months ago
High capacity and automatic functional extraction tool for industrial VLSI circuit designs
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
Sasha Novakovsky, Shy Shyman, Ziyad Hanna