Sciweavers

4940 search results - page 317 / 988
» On the Complexity of Universal Programs
Sort
View
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
15 years 5 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
CISIS
2009
IEEE
15 years 4 months ago
The Health-e-Waterways Project - Data Integration for Smarter, Collaborative, Whole-of-Water Cycle Management
The Health-e-Waterways Project is a collaboration between the University of Queensland, Microsoft Research and the South East Queensland Healthy Waterways Partnership (SEQ-HWP) (a...
Abdulmonem Alabri, Jane Hunter, Catharine van Inge...
HCI
2009
15 years 4 months ago
The Evolution of a Web Accessibility Testing Protocol
In early 2007, the California State University (CSU) system initiated a program to make all information technology accessible to persons with disabilities; the authors were appoint...
Tom Jewett, Wayne Dick
ECEASST
2010
15 years 1 months ago
Security Evaluation and Hardening of Free and Open Source Software (FOSS)
Abstract: Recently, Free and Open Source Software (FOSS) has emerged as an alternative to Commercial-Off-The-Shelf (COTS) software. Now, FOSS is perceived as a viable long-term sol...
Robert Charpentier, Mourad Debbabi, Dima Alhadidi,...
OOPSLA
2009
Springer
16 years 1 months ago
A type and effect system for deterministic parallel Java
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
Robert L. Bocchino Jr., Vikram S. Adve, Danny Dig,...