Sciweavers

1763 search results - page 46 / 353
» A Formalization of Polytime Functions
Sort
View
GG
2008
Springer
14 years 10 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
Hartmut Ehrig, Ulrike Prange
JSW
2007
119views more  JSW 2007»
14 years 9 months ago
Formalizing Mobility in Service Oriented Computing
— The usual scenario of service oriented systems is characterized by several services offering the same functionalities, by new services that are continuosly deployed and by othe...
Claudio Guidi, Roberto Lucchi
SOSYM
2010
119views more  SOSYM 2010»
14 years 4 months ago
Formal specification of non-functional properties of component-based software systems
Component-based software engineering (CBSE) is viewed as an opportunity to deal with the increasing complexity of modern-day software. Along with CBSE comes the notion of component...
Steffen Zschaler
VLSID
2003
IEEE
180views VLSI» more  VLSID 2003»
15 years 10 months ago
Automating Formal Modular Verification of Asynchronous Real-Time Embedded Systems
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
Pao-Ann Hsiung, Shu-Yu Cheng
STACS
2009
Springer
15 years 4 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick