Sciweavers

1175 search results - page 58 / 235
» Abstract computability and algebraic specification
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Deriving Specifications of Dependable Systems: toward a Method
Abstract--This paper proposes a method for deriving formal specifications of systems. To accomplish this task we pass through a non trivial number of steps, concepts and tools wher...
Manuel Mazzara
FAC
2010
140views more  FAC 2010»
13 years 5 months ago
From a domain analysis to the specification and detection of code and design smells
Code and design smells are recurring design problems in software systems that must be identified to avoid their possible negative consequences on development and maintenance. Conse...
Naouel Moha, Yann-Gaël Guéhéneu...
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
SIGSOFT
2005
ACM
14 years 8 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
DAC
1998
ACM
14 years 8 months ago
Design and Specification of Embedded Systems in Java Using Successive, Formal Refinement
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
James Shin Young, Josh MacDonald, Michael Shilman,...