Sciweavers

1676 search results - page 261 / 336
» Formal System Development with KIV
Sort
View
AI
2004
Springer
15 years 4 months ago
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
Ken Kaneiwa
POPL
2004
ACM
16 years 4 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
IFM
2007
Springer
15 years 10 months ago
Qualitative Probabilistic Modelling in Event-B
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
Stefan Hallerstede, Thai Son Hoang
COORDINATION
2009
Springer
16 years 4 months ago
Mobility Models and Behavioural Equivalence for Wireless Networks
In protocol development for wireless systems, the choice of appropriate mobility models describing the movement patterns of devices has long been recognised as a crucial factor for...
Jens Chr. Godskesen, Sebastian Nanz
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
15 years 11 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon