Sciweavers

181 search results - page 27 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
14 years 7 days ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
PLDI
2009
ACM
14 years 2 months ago
Laminar: practical fine-grained decentralized information flow control
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
Indrajit Roy, Donald E. Porter, Michael D. Bond, K...
CONCUR
2006
Springer
13 years 11 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
COMPSAC
2002
IEEE
14 years 25 days ago
A Toolset for Supporting UML Static and Dynamic Model Checking
The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of...
Wuwei Shen, Kevin J. Compton, James Huggins
OTM
2005
Springer
14 years 1 months ago
Selection Using Non-symmetric Context Areas
Abstract. This paper targets with applications running on mobile devices and using context informations. Following previous studies from other authors, we extend the notion of cont...
Diane Lingrand, Stephane Lavirotte, Jean-Yves Tigl...