838 search results - page 33 / 168 » From Natural Language to Formal Proof Goal |
174
click to vote
AINA
2003
IEEE
15 years 9 months ago
2003
IEEE
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
173
click to vote
ASE
2002
15 years 6 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
147
click to vote
LICS
2006
IEEE
16 years 2 days ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
191
click to vote
GRAMMARS
1998
15 years 5 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
188
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...