286 search results - page 53 / 58 » Engineering AgentSpeak(L): A Formal Computational Model |
173
click to vote
PLDI
2009
ACM
16 years 24 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
171
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
153
click to vote
FOSSACS
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
153
click to vote
ISORC
2009
IEEE
16 years 20 days ago
2009
IEEE
In his article entitled "From Play-In Scenarios to Code: An Achievable Dream", David Harel presented a development schema that makes it possible to go from high-level us...
159
click to vote
CHIMIT
2009
ACM
16 years 16 days ago
2009
ACM
System administrators are end-users too. And as end-users, they develop tools, create web pages, write command-line scripts, use spreadsheets, and repurpose existing tools. In sho...