Sciweavers

10055 search results - page 331 / 2011
» Structured programming using processes
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 10 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
16 years 21 days ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
USS
2008
15 years 8 months ago
NetAuth: Supporting User-Based Network Services
In User-Based Network Services (UBNS), the process servicing requests from user U runs under U's ID. This enables (operating system) access controls to tailor service authori...
Manigandan Radhakrishnan, Jon A. Solworth
IFM
2009
Springer
119views Formal Methods» more  IFM 2009»
16 years 1 months ago
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
Jan Stöcker, Frédéric Lang, Hub...
ICANN
2001
Springer
15 years 11 months ago
The Importance of Representing Cognitive Processes in Multi-agent Models
We distinguish between two main types of model: predictive and explanatory. It is argued (in the absence of models that predict on unseen data) that in order for a model to increas...
Bruce Edmonds, Scott Moss