Sciweavers

4743 search results - page 520 / 949
» The PlusCal Algorithm Language
Sort
View
ICFP
2003
ACM
16 years 3 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
ESOP
2009
Springer
15 years 10 months ago
Global Principal Typing in Partially Commutative Asynchronous Sessions
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
Dimitris Mostrous, Nobuko Yoshida, Kohei Honda
96
Voted
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 10 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica
FSEN
2009
Springer
15 years 9 months ago
Modular Schedulability Analysis of Concurrent Objects in Creol
We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the sch...
Frank S. de Boer, Tom Chothia, Mohammad Mahdi Jagh...
DASFAA
2008
IEEE
90views Database» more  DASFAA 2008»
15 years 9 months ago
Even an Ant Can Create an XSD
Abstract. The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of its ...
Ondrej Vosta, Irena Mlynkova, Jaroslav Pokorn&yacu...