Sciweavers

359 search results - page 38 / 72
» Analysis of Compiled Code: A Prototype Formal Model
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 8 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
JSS
2002
101views more  JSS 2002»
13 years 8 months ago
Software requirements validation via task analysis
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...
Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai
CODES
2010
IEEE
13 years 6 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
ENTCS
2006
168views more  ENTCS 2006»
13 years 8 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
14 years 9 months ago
Type Analysis for JavaScript
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
Anders Møller, Peter Thiemann, Simon Holm J...