Sciweavers

1894 search results - page 126 / 379
» A TLA Proof System
Sort
View
120
Voted
ICRA
2002
IEEE
114views Robotics» more  ICRA 2002»
15 years 8 months ago
On Mechanical Control Systems with Nonholonomic Constraints and Symmetries
This paper presents a computationally efficient method for deriving coordinate representations for the equations of motion and the affine connection describing a class of Lagrangi...
Francesco Bullo, Milos Zefran
118
Voted
APLAS
2009
ACM
15 years 8 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
132
Voted
FC
2008
Springer
102views Cryptology» more  FC 2008»
15 years 5 months ago
Identity Theft: Much Too Easy? A Study of Online Systems in Norway
Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal ...
André N. Klingsheim, Kjell Jørgen Ho...
167
Voted
ISCAPDCS
2008
15 years 5 months ago
Parallel Embedded Systems: Where Real-Time and Low-Power Meet
This paper introduces a combination of models and proofs for optimal power management via Dynamic Frequency Scaling and Dynamic Voltage Scaling. The approach is suitable for syste...
Zdravko Karakehayov, Yu Guo
120
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning