Sciweavers

256 search results - page 45 / 52
» Noetherian Spaces in Verification
Sort
View
DAC
1994
ACM
14 years 16 days ago
The Design of High-Performance Microprocessors at Digital
Today's high-performance single-chip CMOS microprocessors are the most complex and challenging chip designs ever implemented. To stay on the leading edge, Digital's micro...
Thomas F. Fox
ECAIW
1994
Springer
13 years 12 months ago
Representing and Executing Agent-Based Systems
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
Michael Fisher
PTS
2008
165views Hardware» more  PTS 2008»
13 years 9 months ago
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Farn Wang, Geng-Dian Huang
C3S2E
2010
ACM
13 years 9 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
LDTA
2010
13 years 8 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju