Sciweavers

286 search results - page 53 / 58
» Engineering AgentSpeak(L): A Formal Computational Model
Sort
View
PLDI
2009
ACM
14 years 1 months ago
Analyzing recursive programs using a fixed-point calculus
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 ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 7 months ago
RTL-Datapath Verification using Integer Linear Programming
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...
Raik Brinkmann, Rolf Drechsler
FOSSACS
2009
Springer
14 years 1 months ago
Synthesis from Component Libraries
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 ...
Yoad Lustig, Moshe Y. Vardi
ISORC
2009
IEEE
14 years 1 months ago
From Requirements to Code Revisited
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...
Tewfik Ziadi, Xavier Blanc, Amine Raji
CHIMIT
2009
ACM
14 years 1 months ago
Scripting practices in complex systems management
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...
Eser Kandogan, Paul P. Maglio, Eben M. Haber, John...