Sciweavers

12774 search results - page 358 / 2555
» A Framework for Proof Systems
Sort
View
IJFCS
2011
78views more  IJFCS 2011»
15 years 1 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
JSW
2008
104views more  JSW 2008»
15 years 6 months ago
Testing Software Assets of Framework-Based Product Families During Application Engineering Stage
An application framework provides reusable design and implementation for a family of software systems. At the application engineering stage, application developers extend framework...
Jehad Al-Dallal, Paul G. Sorenson
NDSS
2009
IEEE
16 years 1 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
IROS
2009
IEEE
114views Robotics» more  IROS 2009»
16 years 1 months ago
A Distributed boundary detection algorithm for multi-robot systems
— We describe a distributed boundary detection algorithm suitable for use on multi-robot systems with dynamic network topologies. We assume that each robot has access to its loca...
James McLurkin, Erik D. Demaine
ASWEC
2007
IEEE
16 years 1 months ago
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
Lars Grunske, Kirsten Winter, Robert Colvin