Sciweavers

1763 search results - page 145 / 353
» A Formalization of Polytime Functions
Sort
View
ICSE
2008
IEEE-ACM
15 years 10 months ago
On the automation of fixing software bugs
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
Andrea Arcuri
CDVE
2007
Springer
124views Visualization» more  CDVE 2007»
15 years 4 months ago
"Integrare", a Collaborative Environment for Behavior-Oriented Design
In order to build complex, large-scale, dependable systems it is necessary to use a development environment with an integrated set of capabilities that supports editing and formal...
Lian Wen, Robert Colvin, Kai Lin, John Seagrott, N...
SAC
2009
ACM
15 years 2 months ago
Towards "WYDIWYS" for MIMI using concept analysis
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
Jie Dai, Remo Mueller, Jacek Szymanski, Guo-Qiang ...
CASES
2007
ACM
15 years 2 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang
FOSSACS
2010
Springer
15 years 4 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke