2076 search results - page 26 / 416 » Functional logic overloading |
AML
2010
13 years 8 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
JAR
2010
13 years 3 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
TCAD
2008
13 years 8 months ago
2008
The relatively poor scaling of interconnect in modern digital circuits necessitates a number of design optimizations, which must typically be iterated several times to meet the spe...
TFS
2008
13 years 8 months ago
2008
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...
CAV
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...