1894 search results - page 129 / 379 » A TLA Proof System |
140
Voted
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
220
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. BioModel Analyzer (bma) is a tool for modeling and analyzing biological networks. Designed with a lightweight graphical user interface, the tool facilitates usage for bio...
121
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
174
click to vote
RTA
1993
Springer
15 years 7 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
143
click to vote
FLAIRS
2000
15 years 5 months ago
2000
The paper presents a survey of the VSE system, a kind of CASE-tool for formal software development. It is a summary of a tutorial presentation describing methodology, formalisms, ...