Sciweavers

949 search results - page 37 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
WADT
2004
Springer
14 years 28 days ago
Theoroidal Maps as Algebraic Simulations
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
Narciso Martí-Oliet, José Meseguer, ...
ACSD
2004
IEEE
124views Hardware» more  ACSD 2004»
13 years 11 months ago
A Behavioral Type Inference System for Compositional System-on-Chip Design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc s...
Jean-Pierre Talpin, David Berner, Sandeep K. Shukl...
IPPS
2008
IEEE
14 years 2 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
EUROMICRO
2000
IEEE
14 years 13 hour ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
RTSS
2005
IEEE
14 years 1 months ago
Event Count Automata: A State-Based Model for Stream Processing Systems
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
Samarjit Chakraborty, Linh T. X. Phan, P. S. Thiag...