303 search results - page 35 / 61 » A formal executable semantics of Verilog |
162
Voted
WWW
2003
ACM
16 years 4 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
149
click to vote
APN
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper, we introduce a framework composed of a syntax and its compositional Petri net semantics, for the specification and verification of properties (like authent...
156
Voted
TPHOL
2002
IEEE
15 years 8 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
122
Voted
JUCS
2006
15 years 3 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
116
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
This paper proposes programming constructs to improve the practical application of existing BDI-based agent-oriented programming languages that have formal semantics. The proposed...