BibSonomy publications for /author/HallerMon Feb 06 00:00:00 CET 2012WISEconf/wise/2011338-340Lecture Notes in Computer ScienceA Novel Approach for Interacting with Linked Open Data.69972011dblp Fri Jan 27 00:00:00 CET 2012PEPMconf/pepm/2012117-120Scala-virtualized.2012dblp Wed Jan 25 00:00:00 CET 2012Business Process Management Workshops (2)conf/bpm/2011w2398-410Lecture Notes in Business Information ProcessingData-Privacy Assessments for Application Landscapes: A Methodology.1002011dblp Mon Jan 23 00:00:00 CET 2012IEEE Transactions on Image Processing2889-898Design of Interpolation Functions for Subpixel-Accuracy Stereo-Vision Systems.212012dblp Wed Jan 18 15:56:42 CET 2012WISEconf/wise/2010400-410Lecture Notes in Computer ScienceRaUL: RDFa User Interface Language - A Data Processing Model for Web Applications.64882010rdf rdfa semantic_web webdevelopment Fri Jan 06 00:00:00 CET 2012ISPDCconf/ispdc/201179-85Real-Time Image Rectification and Stereo Reconstruction System on the GPU.2011dblp Tue Jan 03 14:05:35 CET 2012Proceedings of IE 07: 3rd International Conference on Intelligent Environments, Ulm, GermanyIE200740–47Collaborative Business Items2007myown Collaborative business items - or CoBIs - are an approach to build pervasive computing systems in order to support business processes with mobile assets and items. CoBIs enable the delegation of tasks originally located in stationary large back-end systems down to mobile assets and items. For instance, these tasks include the direct, i.e. item-centric, monitoring and detection of hazardous situations like they may occur when working with chemical goods. We refer to this delegation as logic on the items. The items are augmented by sensor technology and made aware of their surroundings and actions imposed on them. Collaboratively, they are able to reason on common states and enforce pre-defined conditions with only temporary support of stationary back-end computer systems. As a result CoBIs allow a more fine-grained, immediate, realtime and stable control of the handling of items. This paper presents the CoBIs fundamentals and results derived from implementations in a workplace safety scenario on handling various chemical goods. The results back up our claim that for the use of business logic in critical - e.g. dangerous - environments relocation of business logic onto items is required.Tue Jan 03 00:00:00 CET 2012AMCISconf/amcis/2009540Innovation Mobs - Unlocking the Innovation Potential of Virtual Communities.2009dblp Thu Dec 29 00:00:00 CET 2011J. Enterprise Inf. Management3356-370Going beyond auto-ID: a service-oriented smart items infrastructure.202007dblp Mon Dec 19 00:00:00 CET 2011Microelectronics Reliability9-111658-1661Photoelectric Laser Stimulation applied to Latch-Up phenomenon and localization of parasitic transistors in an industrial failure analysis laboratory.512011dblp Thu Dec 08 14:24:14 CET 2011SASconf/sas/2011351-368Lecture Notes in Computer ScienceSoftware Verification Using k-Induction68872011induction k-induction software verification We present combined-case k-induction, a novel technique for veri- fying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by sepa- rately proving a base case and inductive step. We present a new k-induction rule that takes an unstructured, reducible control flow graph (CFG), a natural loop oc- curring in the CFG, and a positive integer k, and constructs a single CFG in which the given loop is eliminated via an unwinding proportional to k. Recursively ap- plying the proof rule eventually yields a loop-free CFG, which can be checked using SAT-/SMT-based techniques. We state soundness of the rule, and investi- gate its theoretical properties. We then present two implementations of our tech- nique: K-INDUCTOR, a verifier for C programs built on top of the CBMC model checker, and K-BOOGIE, an extension of the Boogie tool. Our experiments, using a large set of benchmarks, demonstrate that our k-induction technique frequently allows program verification to succeed using significantly weaker loop invariants than are required with the standard inductive invariant approach.Thu Dec 08 10:25:21 CET 2011SASconf/sas/2011351-368Lecture Notes in Computer ScienceSoftware Verification Using k-Induction68872011k-induction Wed Dec 07 15:04:59 CET 2011WISEconf/wise/2010400-410Lecture Notes in Computer ScienceRaUL: RDFa User Interface Language - A Data Processing Model for Web Applications.64882010rdf rdfa semantic_web webdevelopment Mon Dec 05 00:00:00 CET 2011CoRRBody-and-cad Geometric Constraint Systemsabs/1006.11262010dblp Mon Dec 05 00:00:00 CET 2011CoRRA Platform for Implementing Secure Wireless Ad Hoc Networksabs/1007.09172010dblp Mon Dec 05 00:00:00 CET 2011CoRRTerm-based composition of security protocolsabs/0908.30832009dblp Mon Dec 05 00:00:00 CET 2011CoRRAutomated Composition of Security Protocolsabs/0908.43252009dblp Mon Dec 05 00:00:00 CET 2011CoRRExtending WS-Security to Implement Security Protocols for Web Servicesabs/0909.16392009dblp Mon Dec 05 00:00:00 CET 2011CoRRInformal specification-based performance evaluation of security protocolsabs/0908.28712009dblp Mon Dec 05 00:00:00 CET 2011CoRRComponent based platform for multimedia applicationsabs/0908.30822009dblp