Sciweavers

103 search results - page 2 / 21
» Typed Normal Form Bisimulation
Sort
View
ER
1994
Springer
128views Database» more  ER 1994»
13 years 9 months ago
A Normal Form Object-Oriented Entity Relationship Diagram
A normal form object-oriented entity relationship (OOER) diagram is presented to address a set of 00 data modelling issues, viz. the inability to judge the quality of an 00 schema,...
Tok Wang Ling, Pit Koon Teo
AAAI
2010
13 years 3 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
PARLE
1987
13 years 8 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
LPAR
2012
Springer
12 years 27 days ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
JLP
2007
86views more  JLP 2007»
13 years 5 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...