Sciweavers

7988 search results - page 224 / 1598
» A Useful Undecidable Theory
Sort
View
WWW
2011
ACM
14 years 7 months ago
Choreography conformance via synchronizability
Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distrib...
Samik Basu, Tevfik Bultan
CADE
2011
Springer
14 years 20 days ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
FROCOS
2011
Springer
14 years 10 days ago
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
121
Voted
CONCUR
2012
Springer
13 years 3 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
76
Voted
SYNASC
2006
IEEE
64views Algorithms» more  SYNASC 2006»
15 years 6 months ago
Scheme-Based Systematic Exploration of Natural Numbers
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
Madalina Hodorog, Adrian Craciun