Sciweavers

1763 search results - page 84 / 353
» A Formalization of Polytime Functions
Sort
View
SIGSOFT
2010
ACM
14 years 7 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
15 years 2 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
ITRUST
2005
Springer
15 years 3 months ago
ST-Tool: A CASE Tool for Modeling and Analyzing Trust Requirements
ST-Tool is a graphical tool integrating an agent-oriented requirements engineering methodology with tools for the formal analysis of models. Essentially, the tool allows designers ...
Paolo Giorgini, Fabio Massacci, John Mylopoulos, A...
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
15 years 1 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
EURODAC
1990
IEEE
74views VHDL» more  EURODAC 1990»
15 years 1 months ago
Matching system and component behaviour in MIMOLA synthesis tools
This paper discusses the selection of available components during high-level synthesis. We stress the importance of describing the behaviour of available components in some langua...
Peter Marwedel