Sciweavers

7109 search results - page 173 / 1422
» Process Algebra with Combinators
Sort
View
KI
2001
Springer
15 years 8 months ago
Experiments with an Agent-Oriented Reasoning System
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
Christoph Benzmüller, Mateja Jamnik, Manfred ...
122
Voted
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 10 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
131
Voted
WOTUG
2008
15 years 5 months ago
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
Neil C. C. Brown
EUROMICRO
2000
IEEE
15 years 8 months ago
Behavior-Preserving Transformations for Design-for-Test
An important aspect in the design of hardware/software systems is design-for-test. Improving the testability of a hardware/software system typically implies improving the controll...
Jeroen Voeten, Harald P. E. Vranken
131
Voted
RTSS
1998
IEEE
15 years 7 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...