Sciweavers

2432 search results - page 387 / 487
» Cryptographic logical relations
Sort
View
LPNMR
2004
Springer
15 years 9 months ago
Reasoning About Actions and Change in Answer Set Programming
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
Yannis Dimopoulos, Antonis C. Kakas, Loizos Michae...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 9 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
CONCUR
1999
Springer
15 years 8 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
ICDCS
1997
IEEE
15 years 8 months ago
Group Communication Support for Distributed Multimedia and CSCW Systems
The Collaborative Computing Transport Layer (CCTL) is a communication substrate consisting of a suite of multiparty protocols, providing varying service qualities among process gr...
Injong Rhee, Shun Yan Cheung, Phillip W. Hutto, Va...
ECOOP
2006
Springer
15 years 8 months ago
codeQuest:  Scalable Source Code Queries with Datalog
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor